Analyzing Scalability of Parallel Matrix Multiplication Using Dusd
نویسندگان
چکیده
منابع مشابه
Analyzing Scalability of Parallel Algorithms and Architectures
The scalability of a parallel algorithm on a parallel architecture is a measure of its capacity to effectively utilize an increasing number of processors. Scalability analysis may be used to select the best algorithm-architecture combination for a problem under diierent constraints on the growth of the problem size and the number of processors. It may be used to predict the performance of a par...
متن کاملHighly Parallel Sparse Matrix-Matrix Multiplication
Generalized sparse matrix-matrix multiplication is a key primitive for many high performance graph algorithms as well as some linear solvers such as multigrid. We present the first parallel algorithms that achieve increasing speedups for an unbounded number of processors. Our algorithms are based on two-dimensional block distribution of sparse matrices where serial sections use a novel hyperspa...
متن کاملA New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure
The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...
متن کاملParallel Multiplication in F2n Using Condensed Matrix Representation
Abstract: In this paper we explore a matrix representation of binary fields F2n defined by an irreducible trinomial P = X + X + 1. We obtain a multiplier with time complexity of TA + (⌈log2(n)⌉)TX and space complexity of (2n − 1)n AND and (2n − 1)(n − 1) XOR . This multiplier reaches the lower bound on time complexity. Until now this was possible only for binary field defined by AOP (Silverman,...
متن کاملParallel Implementation of Interval Matrix Multiplication
Two main and not necessarily compatible objectives when implementing the product of two dense matrices with interval coefficients are accuracy and efficiency. In this work, we focus on an implementation on multicore architectures. One direction successfully explored to gain performance in execution time is the representation of intervals by their midpoints and radii rather than the classical re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Asian Journal of Information Technology
سال: 2010
ISSN: 1682-3915
DOI: 10.3923/ajit.2010.78.84